Piotr Indyk - PDFSEARCH.IO - Document Search Engine

Piotr Indyk
Results: 118

#	Item
101	(Nearly) Sample-Optimal Sparse Fourier Transform Piotr Indyk MIT Michael Kapralov MIT∗ Add to Reading List Source URL: groups.csail.mit.edu Language: English - Date: 2014-10-03 15:18:39 Fourier analysis Unitary operators Digital signal processing Computational complexity theory Analysis of algorithms Fourier transform Time complexity Computational complexity of mathematical operations Euclidean algorithm Mathematical analysis Theoretical computer science Mathematics
102	Lower Bounds for Sparse Recovery∗ Khanh Do Ba MIT CSAIL Piotr Indyk MIT CSAIL Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2009-11-10 16:09:56 Primality tests Probabilistic complexity theory Disjunct matrix Euclidean algorithm Mathematics Combinatorics Matrix theory
103	Streaming Similarity Search over one Billion Tweets using Parallel Locality-Sensitive Hashing Narayanan Sundaram† , Aizana Turmukhametova ? , Nadathur Satish† , Todd Mostak? , Piotr Indyk? , Samuel Madden? and Pradee Add to Reading List Source URL: istc-bigdata.org Language: English - Date: 2013-09-16 09:08:58 Hashing Artificial intelligence Error detection and correction Cryptographic hash functions Dimension reduction Locality-sensitive hashing Hash table Hash function Nearest neighbor search Search algorithms Information science Information retrieval
104	Nearly Optimal Sparse Fourier Transform Haitham Hassanieh Piotr Indyk Dina Katabi Add to Reading List Source URL: groups.csail.mit.edu Language: English - Date: 2012-07-08 20:37:57 Integral transforms Unitary operators Joseph Fourier Fast Fourier transform Fourier transform Mathematical analysis Fourier analysis Digital signal processing
105	(Nearly) Sample-Optimal Sparse Fourier Transform Piotr Indyk MIT Michael Kapralov MIT∗ Add to Reading List Source URL: www.mit.edu Language: English - Date: 2013-10-11 01:35:02 Fourier analysis Unitary operators Digital signal processing Computational complexity theory Analysis of algorithms Fourier transform Time complexity Computational complexity of mathematical operations Euclidean algorithm Mathematical analysis Theoretical computer science Mathematics
106	Nearly Optimal Sparse Fourier Transform Haitham Hassanieh MIT Piotr Indyk MIT Add to Reading List Source URL: groups.csail.mit.edu Language: English - Date: 2012-07-08 20:42:16 Fourier analysis Analysis of algorithms Digital signal processing Joseph Fourier Unitary operators Fast Fourier transform Discrete Fourier transform Fourier transform Big O notation Mathematical analysis Mathematics Theoretical computer science
107	Sparse Fast Fourier Transform Code Documentation (SFFT 1.0 and 2.0) Haitham Hassanieh Piotr Indyk Add to Reading List Source URL: groups.csail.mit.edu Language: English - Date: 2013-11-29 01:33:38 Electronics Linear filters Electrical engineering Digital signal processing Electronic design Electronic filter Gaussian filter Filter Estimation theory Electronic engineering Filter theory Signal processing
108	Simple and Practical Algorithm for Sparse Fourier Transform Haitham Hassanieh MIT Piotr Indyk MIT Add to Reading List Source URL: groups.csail.mit.edu Language: English - Date: 2011-10-06 17:20:38 Unitary operators Joseph Fourier Fourier transform Big O notation Convolution Fourier series Mathematical analysis Fourier analysis Digital signal processing
109	Nearly Optimal Sparse Fourier Transform Haitham Hassanieh MIT Piotr Indyk MIT Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2012-07-08 20:42:16 Fourier analysis Analysis of algorithms Digital signal processing Joseph Fourier Unitary operators Fast Fourier transform Discrete Fourier transform Fourier transform Big O notation Mathematical analysis Mathematics Theoretical computer science
110 $Efficient and Reliable Low-Power Backscatter Networks Jue Wang Haitham Hassanieh Dina Katabi Piotr Indyk Massachusetts Institute of Technology {jue_w, haithamh, dk, indyk}@mit.edu Abstract – There is a long-standing vi$	Efficient and Reliable Low-Power Backscatter Networks Jue Wang Haitham Hassanieh Dina Katabi Piotr Indyk Massachusetts Institute of Technology {jue_w, haithamh, dk, indyk}@mit.edu Abstract – There is a long-standing vi Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2012-07-09 09:21:07 Computing Coding theory Radio resource management Information theory Error detection and correction Low-density parity-check code Time division multiple access ALOHAnet Code division multiple access Telecommunications engineering Technology Wireless sensor network